Learning action models with minimal observability
نویسندگان
چکیده
منابع مشابه
The KdV Action and Deformed Minimal Models
An action is constructed that gives an arbitrary equation in the KdV or MKdV hierarchies as equation of motion; the second Hamiltonian structure of the KdV equation and the Hamiltonian structure of the MKdV equation appear as Poisson bracket structures derived from this action. Quantization of this theory can be carried out in two different schemes, to obtain either the quantum KdV theory of Ku...
متن کاملEfficient Reinforcement Learning with Relocatable Action Models
Realistic domains for learning possess regularities that make it possible to generalize experience across related states. This paper explores an environment-modeling framework that represents transitions as state-independent outcomes that are common to all states that share the same type. We analyze a set of novel learning problems that arise in this framework, providing lower and upper bounds....
متن کاملMinimal Observability for Transactional Hierarchical Services
For complex services, logging is an integral part of many middleware aspects, especially, transactions and monitoring. In the event of a failure, the log allows us to deduce the cause of failure (diagnosis), recover by compensating the logged actions (atomicity), etc. However, for heterogeneous services, logging all the actions is often impracticable due to privacy/security constraints. Also, l...
متن کاملOn Avoidance Learning with Partial Observability
We study a framework where agents have to avoid aversive signals. The agents are given only partial information, in the form of features that are projections of task states. Additionally, the agents have to cope with non-determinism, defined as unpredictability on the way that actions are executed. The goal of each agent is to define its behavior based on featureaction pairs that reliably avoid...
متن کاملLearning Partially Observable Action Models
In this paper we present tractable algorithms for learning a logical model of actions’ effects and preconditions in deterministic partially observable domains. These algorithms update a representation of the set of possible action models after every observation and action execution. We show that when actions are known to have no conditional effects, then the set of possible action models can be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2019
ISSN: 0004-3702
DOI: 10.1016/j.artint.2019.05.003